Tutte Algebras of Graphs and Formal Group Theory

نویسنده

  • NIGEL RAY
چکیده

In 1947, in a beautiful and influential paper [15], Tutte introduced a powerful algebraic framework for constructing invariants of multigraphs. This has spread increasing ripples down the years, and is, for example, a forerunner to certain recent exciting developments in knot theory [5]. However, combinatorialists have tended to play down the algebraic components of Tutte's work, and concentrate instead on the graph theory. Indeed, in the process of improving and extending his original ideas, Tutte himself [16] has felt the need to present the material 'cleared of algebraic superstructure'. It is our contention that this superstructure is actually remarkably interesting, and that part of it exposes links between combinatorics and the theory of formal groups, and thereby also with the algebraic topology of spaces such as loops on the 3-sphere and infinite-dimensional complex projective space [10]. Our aim here is to concentrate on one aspect of Tutte's ring, which is polynomial in infinitely many variables over Z, by restricting attention to simple graphs. This reduces the number of variables to one, but has the attraction that we may enrich the structure in a natural and appealing way to that of a Hopf algebra supporting a difference operator (actually the discrete derivative); in this procedure, a graph becomes identified with its chromatic polynomial. These topics are the subject matter of our § 1 and § 2. We then generalise so as to include recent developments in umbral calculus [8], which acts as the bridge with the theory of formal groups. This involves incorporating into the algebraic construction information concerning partitions of the vertices of the graphs, as explained in § 3 and § 4. There again results a polynomial algebra in one variable, but this time over a larger ring <£*. Once more we can naturally impose the structure of a Hopf algebra, which now supports an umbral difference operator, and a graph becomes identified with its umbral chromatic polynomial, as introduced in [12]. We are thus able in § 5 to establish a combinatorial interpretation for an arbitrary formal group over any ring free of additive torsion. This of course includes the universal case, and raises several interesting questions. We save a discussion of the interactions with algebraic topology for the future. We refer the reader to Aigner [1] for general combinatorial terminology, to S weedier [14] for all information concerning Hopf algebras, and to Hazewinkel [4] for an encyclopaedic description of the theory of formal groups. It is a pleasure to acknowledge enjoyable and fruitful discussions with several mathematicians during the development of this material. In particular, Bill Schmitt provided privileged access to his ongoing work on combinatorial Hopf algebras, and so helped inspire § 2; we are currently working together on a sequel

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tutte sets in graphs I: Maximal tutte sets and D-graphs

A well-known formula of Tutte and Berge expresses the size of a maximum matching in G in terms of what is usually called the deficiency of G. A subset X of G for which this deficiency is attained is called a Tutte set of G. While much is known about maximum matchings, less is known about the structure of Tutte sets. In this paper, we study the structural aspects of maximal Tutte sets in a graph...

متن کامل

Tutte sets in graphs II: The complexity of finding maximum Tutte sets

A well-known formula of Tutte and Berge expresses the size of a maximum matching in a graph G in terms of what is usually called the deficiency. A subset X of V (G) for which this deficiency is attained is called a Tutte set of G. While much is known about maximum matchings, less is known about the structure of Tutte sets. We explored the structural aspects of Tutte sets in another paper. Here ...

متن کامل

Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs

A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain graph is a gain graph with vertex weights from an abelian semigroup, where the gain group is lattice ordered and acts on the weight semigroup. For weighted gain graphs we establish basic properties and we present general dichromatic and forest-expansion polynomials that are Tutte invariants (they satisfy T...

متن کامل

A Subset Expansion of the Coloured Tutte Polynomial

Bollobás and Riordan introduce a Tutte polynomial for coloured graphs and matroids in [3]. We observe that this polynomial has an expansion as a sum indexed by the subsets of the ground-set of a coloured matroid, generalizing the subset expansion of the Tutte polynomial. We also discuss similar expansions of other contraction–deletion invariants of graphs and matroids. 1. The coloured Tutte pol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992